Optimum phase for rugate filter synthesis by Fourier transforms
نویسندگان
چکیده
منابع مشابه
Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
Discrete transforms are introduced and are defined in a ring of polynomials. These polynomial transforms are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications. Polynomial transforms are particularly well suited for computing discrete two-dimensional convolutions with a minimum number of operations. Efficient algorithms for computing one-d...
متن کاملOptical phase retrieval by phase-space tomography and fractional-order Fourier transforms.
Phase-space tomography is experimentally demonstrated for the determination of the spatially varying amplitude and phase of a quasi-monochromatic optical field by measurements of intensity only. Both fully and partially coherent sources are characterized. The method, which makes use of the fractional-order Fourier transform, also yields the Wigner distribution of the field and works in one or t...
متن کاملImage Enhancement by Elliptic Discrete Fourier Transforms
This paper describes a method of enhancement of grayscale and color image in the frequency domain by the pair of two elliptic discrete Fourier transforms (EDFT). Unlike the traditional discrete Fourier transform (DFT), the EDFT is parameterized and the parameter defines ellipses (not circles) around which the input data are rotated. Methods of the traditional DFT are widely used in image enhanc...
متن کاملDoppler Spectrum Estimation by Ramanujan Fourier Transforms
The Doppler spectrum estimation of a weather radar signal in a classic way can be made by two methods, temporal one based in the autocorrelation of the successful signals, whereas the other one uses the estimation of the power spectral density PSD by using Fourier transforms. We introduces a new tool of signal processing based on Ramanujan sums cq(n), adapted to the analysis of arithmetical seq...
متن کاملSparse Generalized Fourier Transforms ∗
Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Optics
سال: 2010
ISSN: 0003-6935,1539-4522
DOI: 10.1364/ao.50.00c124